ChessVision: Chess Board and Piece Recognition
نویسنده
چکیده
This paper details a method to take an image of a chess board and output a reconstructed computer representation of the board through board and piece recognition. Though techniques for board recognition have been thoroughly explored in the past, especially in relation to chessboard calibration, previous works on piece recognition often focus on non-robust segmentation procedures that rely heavily on the exact color of customized chess boards and pieces. The method presented in this paper improves upon the segmentation-based approaches of previous work in piece recognition by introducing a novel approach using classifiers trained on feature descriptors, which is more robust to the similarities in color seen in real-life chess boards. This work is important for both automating the recording of moves in human chess games and improving the ability of chess-playing AI that depend on vision.
منابع مشابه
Learning to Evaluate Chess Positions with Deep Neural Networks and Limited Lookahead
In this paper we propose a novel supervised learning approach for training Artificial Neural Networks (ANNs) to evaluate chess positions. The method that we present aims to train different ANN architectures to understand chess positions similarly to how highly rated human players do. We investigate the capabilities that ANNs have when it comes to pattern recognition, an ability that distinguish...
متن کاملChinese Chess State Recognition
In this paper, we present an algorithm that can correctly recognize the state of a Chinese chess game by processing a photo of the chessboard. Some major steps of the algorithm include chessboard rectification using Hough transformation and homographic transformation, chess piece detection using circular Hough transformation and chess piece recognition using SIFT (Scale-Invariant Feature Transf...
متن کاملSolitaire Chess is NP-complete
Solitaire Chess” is a logic puzzle published by ThinkfunTM that can be seen as a single person version of traditional chess. Given a chess board with some chess pieces of the same color placed on it, the task is to capture all pieces but one using only moves that are allowed in chess. Moreover, in each move one piece has to be captured. We prove that deciding if a given instance of Solitaire Ch...
متن کاملHomework 10: Markov Chains & Ranking
Consider a standard chessboard with an 8×8 grid of possible locations. We define a Markov chain by randomly moving a single chess piece on this board. The initial location X0 is sampled uniformly among the 8 = 64 squares. At time t, the piece then chooses Xt+1 by sampling uniformly from the set of legal moves given its current location Xt. For a description of legal chess moves, see: http://en....
متن کاملArithmetic constraints in solving helpmate problems
Chess can be considered as a complex system of arithmetic constraints. There exist both geometric constraints (relationships of pieces on the board) and time constraints (number and order of moves within several variations) in chess. This paper describes a new search stragegy that uses arithmetic constraints to solve a special class of chess problems, so-called helpmates with a very small numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016